New algorithms for generating Conway polynomials over finite fields
نویسندگان
چکیده
منابع مشابه
New Algorithms for Finding Irreducible Polynomials over Finite Fields
We present a new algorithm for finding an irreducible polynomial of specified degree over a finite field. Our algorithm is deterministic, and it runs in polynomial time for fields of small characteristic. We in fact prove the stronger result that the problem of finding irreducible polynomials of specified degree over a finite field is deterministic polynomial-time reducible to the problem of fa...
متن کاملGenerating series for irreducible polynomials over finite fields
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the case of the multi-degree and the case of indecomposable polynomials.
متن کاملSome New Permutation Polynomials over Finite Fields
In this paper, we construct a new class of complete permutation monomials and several classes of permutation polynomials. Further, by giving another characterization of opolynomials, we obtain a class of permutation polynomials of the form G(x) + γTr(H(x)), where G(X) is neither a permutation nor a linearized polynomial. This is an answer to the open problem 1 of Charpin and Kyureghyan in [P. C...
متن کاملEecient Approximation Algorithms for Sparse Polynomials over Finite Fields
We obtain new lower bounds on the number of non zeros of sparse poly-nomials and give a fully polynomial time (;) approximation algorithm for the number of non-zeros of multivariate sparse polynomials over a nite eld of q elements and degree less than q ? 1. This answers partially to an open problem of D. Grigoriev and M. Karpinski. Also, probabilistic and determin-istic algorithms for testing ...
متن کاملSome algorithms for skew polynomials over finite fields
In this paper, we study the arithmetics of skew polynomial rings over finite fields, mostly from an algorithmic point of view. We give various algorithms for fast multiplication, division and extended Euclidean division. We give a precise description of quotients of skew polynomial rings by a left principal ideal, using results relating skew polynomial rings to Azumaya algebras. We use this des...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2004
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2004.03.002